By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 23, Issue 4, pp. 671-894

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A New Approach to Stable Matching Problems

Ashok Subramanian

pp. 671-700

BibTeX  Abstract Full Text:  PDF

Wait-Free Consensus Using Asynchronous Hardware

Benny Chor, Amos Israeli, and Ming Li

pp. 701-712

BibTeX  Abstract Full Text:  PDF

Inferring Evolutionary History From DNA Sequences

Sampath K. Kannan and Tandy J. Warnow

pp. 713-737

BibTeX  Abstract Full Text:  PDF

Dynamic Perfect Hashing: Upper and Lower Bounds

Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan

pp. 738-761

BibTeX  Abstract Full Text:  PDF

Measure, Stochasticity, and the Density of Hard Languages

Jack H. Lutz and Elvira Mayordomo

pp. 762-779

BibTeX  Abstract Full Text:  PDF

Finding $k$ Disjoint Paths in a Directed Planar Graph

Alexander Schrijver

pp. 780-788

BibTeX  Abstract Full Text:  PDF

Finite Automata Computing Real Functions

Karel Culik, II and Juhani Karhumäki

pp. 789-814

BibTeX  Abstract Full Text:  PDF

On the Complexity of Bilinear Forms over Associative Algebras

Nader H. Bshouty

pp. 815-833

BibTeX  Abstract Full Text:  PDF

A New Lower Bound Technique and Its Application: Tight Lower Bound for a Polygon Triangulation Problem

Prakash Ramanan

pp. 834-851

BibTeX  Abstract Full Text:  PDF

On "Axiomatising Finite Concurrent Processes"

Luca Aceto

pp. 852-863

BibTeX  Abstract Full Text:  PDF

The Complexity of Multiterminal Cuts

E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis

pp. 864-894

BibTeX  Abstract Full Text:  PDF